FORMAL-GRAMMATICAL TYPOLOGY OF TWO-SYLLABLE SENTENCES WITH SUBJECT VERBS SOUNDING INCOMPLETE PERSONAL PARADIGM

Parsing incomplete sentences

An efficient context-free parsing algorithm is presented that can parse sentences with unknown parts of unknown length. It produces in finite form all possible parses (often infinite in number) that could account for the missing parts. The algorithm is a variation on the construction due to Earley. However, its presentation is such that it can readily be adapted to any chart parsing schema (top...

Parsing Incomplete Sentences Revisited

We describe a context-free parsing algorithm to deal with incomplete sentences, including unknown parts of unknown length. It produces a finite shared-forest compiling all parses, often infinite in number, that could account for both the error and the missing parts. In contrast to previous works, we derive profit from a finer dynamic programming construction, leading to an improved computationa...

Two Formal Representations of the Thematic-Rhematic Structure of Sentences

In this paper, we give two formal representations of the thematic-rhematic (T-R) structure of a natural language discourse. One is based on the concept of ontological promiscuity and the other based on a typed A-calculus.

Neural Validation of Grammatical Correctness of Sentences

In this paper, the idea of validating the correctness of sentences has been presented. In the proposed solution, traditional and modern theories of syntax grammar were used. In addition, preprocessing of sentences and neural approach to the problem has been shown. For different sentences the proposed method has been tested. Research results were presented and discussed in terms of the advantage...

Why Typology Doesn’t Matter to Grammatical Theory